package com.waitingresult.leetcode.secondary;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

/**
 * @Author: WangShuai
 * @CreateTime: 2022-10-24  10:30
 * @Description:
 * @Version: 1.0
 */
public class Lc915 {
    /**
     * 给定一个数组  将其划分为两个连续子数组 左边的数组的每一个元素都需要小于右边的数组
     * 输入：nums = [5,0,3,8,6]
     * 输出：3
     * 解释：left = [5,0,3]，right = [8,6]
     */
    public static void main(String[] args) {
        int[] right = {5,0,3,8,6};
        System.out.println(partitionDisjoint(right));

    }
    public static int partitionDisjoint(int[] nums) {
        int count = 0;
        int maxValue = nums[0];
        ArrayList<Integer> objects = new ArrayList<>();
        return count;
    }
}
